Computation of pseudospectra via spectral projectors

نویسنده

  • P. Van Dooren
چکیده

In this note, we discuss new techniques for analyzing the pseudospectra of matrices and propose a numerical method for computing the spectral projector associated with a group of eigenvalues enclosed by a polygonal curve. Numerital tests are reported.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A reduced basis approach to large-scale pseudospectra computation

For studying spectral properties of a non-normal matrix A ∈ Cn×n, information about its spectrum σ(A) alone is usually not enough. Effects of perturbations on σ(A) can be studied by computing ε-pseudospectra, that is the level-sets of the resolvent norm function g(z) = ‖(zI−A)‖2. The computation of ε-pseudospectra requires determining the smallest singular values σmin(zI − A) on for all z on a ...

متن کامل

Pseudospectra of rectangular matrices

Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...

متن کامل

Properties and computations of matrix pseudospectra

Pseudospectra were introduced as early as 1975 and became popular tool during the 1990s.In this paper, we give a new definition of pseudospectra by using QR decomposition. Some properties of pseduospectra are explored and an algorithm for the computation of pseduospectra is given.

متن کامل

Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices Departments of Mathematics Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices

The eld of values and pseudospectra are tools which yield insight into the spectral behavior of a matrix. For large sparse matrices, both sets can be eeciently computed using a Lanczos type method. Since both computations can be done in a natural parallel way, we have developed a package including Fortran and PVM routines. Experiments show that the PVM codes achieve excellent speed-ups and eeci...

متن کامل

Parallel computation of pseudospectra by fast descent q

The pseudospectrum descent method (PsDM) is proposed, a new parallel method for the computation of pseudospectra. The idea behind the method is to use points from an already existing pseudospectrum level curve oK to generate in parallel the points of a new level curve oKd such that d < . This process can be continued for several steps to approximate several pseudospectrum level curves lying ins...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003